//
// Created by mac on 2/22/22.
//

#include <vector>
using namespace std;
int searchInsert(vector<int>& nums, int target) {

    for (int i = 0; i < nums.size(); ++i) {
        if(nums[i]>=target){
            return i+1;
        }
    }
    return nums.size();
}